Pursuit games with bounded accelerations

Visibility-Based Pursuit-Evasion with Bounded Speed

This paper presents an algorithm for a visibility-based pursuit-evasion problem in which bounds on the speeds of the pursuer and evader are given. The pursuer tries to find the evader inside of a simply-connected polygonal environment, and the evader in turn tries actively to avoid detection. The algorithm is at least as powerful as the complete algorithm for the unbounded speed case, and with ...

Repeated Games with Bounded Entropy

We investigate the asymptotic behavior of the maxmin values of repeated two-person zero-sum games with a bound on the strategic entropy of the maximizer’s strategies while the other player is unrestricted. We will show that if the Ž . bound h n , a function of the number of repetitions n, satisfies the condition Ž . Ž . nŽ Ž .. Ž .Ž . h n rn a g n a ` , then the maxmin value W h n converges to ...

Dynamic Electromagnetic Evasion-Pursuit Games with Uncertainty

We consider two player electromagnetic evasion-pursuit games where each player must incorporate significant uncertainty into their design strategies to disguise their intension and confuse their opponent. In this paper, the evader is allowed to make dynamic changes to his strategies in response to the dynamic input with uncertainty from the interrogator. The problem is formulated in two differe...

Pursuit- Evasion Games

Two players, Red and Blue, each independently choose a vertex of a connected graph G. Red must then pay Blue an amount equal to the distance between the vertices chosen. In this note, w e investigate the value v(G) of this pursuit-evasion game for various classes of graphs G, as well as those optimal mixed strategies for achieving v(G). It is shown that some rather counterintuitive behavior can...

How Pursuit-evasion Games help